MIST: Maximum Information Spanning Trees for dimension reduction of biological data sets
نویسندگان
چکیده
منابع مشابه
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملProgression Reconstruction from Unsynchronized Biological Data using Cluster Spanning Trees
Identifying the progression-order of an unsynchronized set of biological samples is crucial for comprehending the dynamics of the underlying molecular interactions. It is also valuable in many applied problems such as data denoising and synchronization, tumor classification and cell lineage identification. Current methods that attempt solving this problem are ultimately based either on polynomi...
متن کاملDimension reduction for finite trees in l1
We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...
متن کاملSpanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
For a spanning tree T of a graph G, we define the total excess te(T, k) of T from k as te(T, k) := ∑ v∈V (T )max{dT (v)− k, 0}, where dT (v) is the degree of a vertex v in T . In this paper, we show the following; if G is a 3-connected graph on a surface with Euler characteristic χ < 0, then G has a spanning ⌈8−2χ 3 ⌉ -tree T with te(T, 3) ≤ −2χ − 1. We also show an application of this theorem ...
متن کاملMaximum Leaf Spanning Trees of Growing Sierpinski Networks Models
The dynamical phenomena of complex networks are very difficult to predict from local information due to the rich microstructures and corresponding complex dynamics. On the other hands, it is a horrible job to compute some stochastic parameters of a large network having thousand and thousand nodes. We design several recursive algorithms for finding spanning trees having maximal leaves (MLS-trees...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btp109